A False-name-Proof Double Auction Protocol for Arbitrary Evaluation Values
نویسندگان
چکیده
منابع مشابه
Robust Double Auction Protocol against False-Name Bids
Internet auctions have become an integral part of Electronic Commerce (EC) and a promising field for applying agent technologies. Although the Internet provides an excellent infrastructure for large-scale auctions, we must consider the possibility of a new type of cheating, i.e., a bidder trying to profit from submitting several bids under fictitious names (false-name bids). Double auctions are...
متن کاملPrice-oriented, Rationing-free Protocol: Guideline for Designing Strategy/False-name Proof Auction Protocols
We identify a distinctive class of combinatorial auction protocols called a Price-oriented, Rationing-free (PORF) protocol, which can be used as a guideline for developing strategy/false-name proof protocols. A PORF protocol is automatically guaranteed to be strategy-proof, i.e., for each agent, declaring its true evaluation values is an optimal strategy regardless of the declarations of other ...
متن کاملFalse - name - Proof Combinatorial Auction Mechanisms ( extended abstract )
Although the Internet provides an excellent infrastructure for executing combinatorial auctions, we must consider the possibility of new types of cheating. For example, a bidder may try to profit from submitting false bids under fictitious names such as multiple e-mail addresses. Such an action is very difficult to detect since identifying each participant on the Internet is virtually impossibl...
متن کاملFalse-name-proof Combinatorial Auction Design via Single-minded Decomposition
This paper proposes a new approach to building falsename-proof (FNP) combinatorial auctions from those that are FNP only with single-minded bidders, each of whom requires only one particular bundle. Under this approach, a general bidder is decomposed into a set of single-minded bidders, and after the decomposition the price and the allocation are determined by the FNP auctions for single-minded...
متن کاملCharacterization of Strategy/False-name Proof Combinatorial Auction Protocols: Price-oriented, Rationing-free Protocol
This paper introduces a new distinctive class of combinatorial auction protocols called priceoriented, rationing-free (PORF) protocols. The outline of a PORF protocol is as follows: (i) for each bidder, the price of each bundle of goods is determined independently of his/her own declaration (while it can depend on the declarations of other bidders), (ii) we allocate each bidder a bundle that ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2004
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.19.234